Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems
نویسندگان
چکیده
منابع مشابه
On solving permutation scheduling problems with ant colony optimization
A new approach for solving permutation scheduling problems with Ant Colony Optimization is proposed in this paper. The approach assumes that no precedence constraints between the jobs have to be fulfilled. It is tested with an ant algorithm for the Single Machine Total Weighted Deviation Problem. In the new approach ants allocate the places in the schedule not sequentially, as in the standard a...
متن کاملsolving resource constraint project scheduling problems using modified ant colony optimization
resource constraints project scheduling problem (rspsp) seeks proper sequence of implementation of project activities in a way that the precedence relations and different type of resource constraints are met concurrently. rcpsp tends to optimize some measurement function as make-span, cost of implementation, number of tardy tasks and etc. as rcpsp is assumed as an np-hard problem so, different ...
متن کاملSolving the Airline Recovery Problem By Using Ant Colony Optimization
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
متن کاملSolving Solid Waste Disposal Problems
firehouse, technical assistance could be solicited. For example, the county supervisor of the Farmers Home Administration might be called in to discuss that agency's requirements regarding financing for public water and waste disposal facilities. Farmers Home is authorized to provide financial assistance to rural "associations" for the purpose of installing community domestic water and waste sy...
متن کاملAnt Colony Optimization for Optimal Control Problems
Abstract. Ant algorithm optimization is used to solve a general class of optimal control problems with single input control. The discretized form of the optimal control problem is converted to a quasi quadratic assignment problem in the time-control space. By applying the ant optimization algorithm on this problem, a piece-wise constant approximation is obtained for the optimal control. Impleme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Statistics
سال: 2009
ISSN: 1549-3644
DOI: 10.3844/jmssp.2009.199.205